Nonlinear Program Construction and Verification Method Based on Partition Recursion and Morgan's Refinement Rules

The traditional program refinement strategy cannot be refined to an executable program, and there are issues such as low verification reliability automation. To solve the above problems, this paper proposes a nonlinear construction method based on partition recursion Morgan's rules. First, we use recursive definition technique characterize initial specification. specification is then transformed into GCL(Guarded Command Language) programs using loop invariant derivation Furthermore, VCG (Verification Condition Generator) used in GCL generate condition automatically. Isabelle theorem prover validates program's correctness. Finally, code generates C++ automatically via conversion system. effectiveness of demonstrated binary tree preorder traversal example. This addresses problem that process's difficult obtain process insufficiently detailed. At same time, improves automation reduces manual workload.